Spanning tree manipulation and the travelling salesman problem
نویسندگان
چکیده
منابع مشابه
Monte-Carlo Tree Search for the Physical Travelling Salesman Problem
The significant success of MCTS in recent years, particularly in the game Go, has led to the application of MCTS to numerous other domains. In an ongoing effort to better understand the performance of MCTS in open-ended realtime video games, we apply MCTS to the Physical Travelling Salesman Problem (PTSP). We discuss different approaches to tailor MCTS to this particular problem domain and subs...
متن کاملMinimum Spanning Tree and Approximation of the Traveling Salesman Problem
A tree T is defined as a graph without any cycles. If edges are weighted, then we can define the minimum spanning tree (MST) of a graph G. The MST is the tree with smallest total edge weight that connects every node in G. Note that G must be a connected graph for any spanning tree, let alone a minimum spanning tree, to exist. We denote this MST as T ∗, which will be a subgraph of G (i.e., the e...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملAnt colonies for the travelling salesman problem.
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...
متن کاملA Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1968
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/10.4.374